On heuristics for finding loop cutsets in multiply-connected belief networks
نویسنده
چکیده
We introduce a new heuristic algorithm for the problem of finding minimum size loop cutsets in multiply connected belief networks. We compare this algorithm to that proposed in [Suermondt and Cooper, 1988]. We provide lower bounds on the performance of these algorithms with respect to one another and with respect to optimal. We demonstrate that no heuristic algorithm for this problem can be guaranteed to produce loop cutsets within a constant difference from optimal. We discuss experimental results based on randomly generated networks, and discuss future work and open questions.
منابع مشابه
Probabilistic inference in multiply connected belief networks using loop cutsets
The method of conditioning permits probabilistic inference in multiply connected belief networks using an algorithm by Pearl. This method uses a select set of nodes, the loop cutset, to render the multiply connected network singly connected. We discuss the function of the nodes of the loop cutset and a condition that must be met by the nodes of the loop cutset. We show that the problem of findi...
متن کاملUpdating Probabilities in Multiply-Connected Belief Networks
This paper focuses on probability updates in multiply-connected belief networks. Pearl has designed the method of conditioning, which enables us to apply his algorithm for belief updates in singly-connected networks to multiply-connected belief networks by selecting a loop-cutset for the network and instantiating these loop-cutset nodes. We discuss conditions that need to be satisfied by the se...
متن کاملEpsilon-cutset Eeect in Bayesian Networks of Arbitrary Topology
The paper investigates the behavior of iterative belief propagation algorithm (IBP) in Bayesian networks with loops. In multiply-connected network, IBP is only guaranteed to converge in linear time to the correct posterior marginals when evidence nodes form a loop-cutset. We propose an-cutset criteria that IBP will converge and compute posterior marginals close to correct when a single value in...
متن کاملcutset effect in Bayesian networks
The paper investigates the behavior of iterative belief propagation algorithm (IBP) in Bayesian networks with loops. In multiply-connected network, IBP is only guaranteed to converge in linear time to the correct posterior marginals when evidence nodes form a loop-cutset. We propose an -cutset criteria that IBP will converge and compute posterior marginals close to correct when a single value i...
متن کاملExtending Recurrence Local Computation Approach Towards Ordering Composite Beliefs in Multiply Connected Bayesian Belief Networks
The Recurrence Local Computation Method (RLCM) for nding the most probable explanations (MPE) in a Bayesian belief network is valuable in assisting human beings to explain the possible causes of a set of evidences. However, RLCM works only on singly connected belief networks. This paper presents an extension of the RLCM which can be applied to multiply connected belief networks for nding arbitr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990